Recursive sequences and polynomial congruences

نویسندگان

  • Christopher Triola
  • J. Larry Lehman
  • Kenneth S. Berenhaut
  • CHRISTOPHER TRIOLA
چکیده

We consider the periodicity of recursive sequences defined by linear homogeneous recurrence relations of arbitrary order, when they are reduced modulo a positive integer m. We show that the period of such a sequence with characteristic polynomial f can be expressed in terms of the order of ω = x + f as a unit in the quotient ring ‫ޚ‬ m [ω] = ‫ޚ‬ m [x]/ f. When m = p is prime, this order can be described in terms of the factorization of f in the polynomial ring ‫ޚ‬ p [x]. We use this connection to develop efficient algorithms for determining the factorization types of monic polynomials of degree k ≤ 5 in ‫ޚ‬ p [x].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruences for degenerate number sequences

The degenerate Stirling numbers and degenerate Eulerian polynomials are intimately connected to the arithmetic of generalized factorials. In this article we show that these numbers and similar sequences may in fact be expressed as p-adic integrals of generalized factorials. As an application of this identiication we deduce systems of congruences which are analogues and generalizations of the Ku...

متن کامل

A Method for Determining the Mod-2k Behaviour of Recursive Sequences, with Applications to Subgroup Counting

We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Fuß–Catalan numbers, and to subgroup counting functions associated with Hecke groups and their lifts. This leads to numerous new results, including many extensions of known results to higher powers of 2. ∗Research ...

متن کامل

Primitive Divisors of Quadratic Polynomial Sequences

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of terms with a primitive divisor has a natural density. We discuss two heuristic arguments to suggest a value for that density, one using recent advances made ...

متن کامل

Some Congruences for Central Binomial Sums Involving Fibonacci and Lucas Numbers

We present several polynomial congruences about sums with central binomial coefficients and harmonic numbers. In the final section we collect some new congruences involving Fibonacci and Lucas numbers.

متن کامل

Congruences for Visibly Pushdown Languages

We study congruences on words in order to characterize the class of visibly pushdown languages (VPL), a subclass of context-free languages. For any language L, we define a natural congruence on words that resembles the syntactic congruence for regular languages such that this congruence is of finite index if, and only if, L is a VPL. We then study the problem of finding canonical minimal determ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010